Phrases Computer Previous Year Question Paper and Solution with PDF

Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations

Phrases
Previous Year Questions

Phrases
Previous Year Questions
Phrases

Phrases Previous Year Questions (PYQs)

Phrases Computer PYQ

Qus : 1

If we can generate a maximum of 4 Boolean functions using n Boolean variables, what will be minimum value of n?

NIMCET PREVIOUS YEAR QUESTION

1
2
3
4
Go to Discussion

Solution

Qus : 2

The Process when processor fetch or decode another instruction during the execution of current instruction is called

1
2
3
4
Go to Discussion

Solution

Pipelining is the process of accumulating instruction from the processor through a pipeline. It allows storing and executing instructions in an orderly process. It is also known as pipeline processing. Pipelining is a technique where multiple instructions are overlapped during execution.

Qus : 3

Which of the following is used by ALU to store the intermediate results?

1
2
3
4
Go to Discussion

Solution

An accumulator is a type of register included in a CPU. It acts as a temporary storage location which holds an intermediate value in mathematical and logical calculations. Intermediate results of an operation are progressively written to the accumulator, overwriting the previous value. For example, in the operation "3 + 4 + 5," the accumulator would hold the value 3, then the value 7, then the value 12. The benefit of an accumulator is that it does not need to be explicitly referenced, which conserves data in the operation statement.

Qus : 4

One TeraByte(TB)=_________GB and One ExaByte(EB)=_______GB

1
2
3
4
Go to Discussion

Solution

Unit	Shortened	Capacity
Bit	b	1 or 0 (on or off)
Byte	B	8 bits
Kilobyte	KB	1024 bytes
Megabyte	MB	1024 kilobytes
Gigabyte	GB	1024 megabytes
Terabyte	TB	1024 gigabytes
Petabyte	PB	1024 terabytes
Exabyte	EB	1024 petabytes
Zettabyte	ZB	1024 exabytes
Yottabyte	YB	1024 zettabytes

Qus : 5

The Cache Memory is more effective because of

1
2
3
4
Go to Discussion

Solution

Locality of reference refers to a phenomenon in which a computer program tends to access same set of memory locations for a particular time period. In other words, Locality of Reference refers to the tendency of the computer program to access instructions whose addresses are near one another.

Qus : 6

Which of the following is the fastest means of memory access for CPU?

1
2
3
4
Go to Discussion

Solution

Registers are a type of computer memory used to quickly accept, store, and transfer data and instructions that are being used immediately by the CPU. The registers used by the CPU are often termed as Processor registers.

Qus : 7

The number (2217)₈ is equivalent to

1
2
3
4
Go to Discussion

Solution

(2217)8 =(010010001111)8

Pair of 4 Bits

1111= F

1000=8

0100=4

(010010001111)8 =(48F)16

Qus : 8

To fetch data from secondary memory which one of the following register is used

1
2
3
4
Go to Discussion

Solution

MAR register is used to access data and instructions from memory during the execution phase of instruction. MAR holds the memory location of data that needs to be accessed. When reading from memory, data addressed by MAR is fed into the MDR (memory data register) and then used by the CPU. When writing to memory, the CPU writes data from MDR to the memory location whose address is stored in MAR. MAR, which is found inside the CPU, goes either to the RAM (random-access memory) or cache.

Qus : 9

The binary multiplication 00*11 will give

1
2
3
4
Go to Discussion

Solution

0*3=0

Qus : 10

Consider a computer system with speed of 10⁶ instructions per second. A program P, having 2n² steps is run on this system, where n is the input size. If n = 10000, what is the execution time for P?

1
2
3
4
Go to Discussion

Solution

$\text{Speed of computer} = 10^6 \text{per second}$

$\text{For n} =10000=10^4$

$Time = \frac{\text{No of tasks}}{\text{Speed of computer}}$

$Time = \frac{2n^2}{10^6}$

$= \frac{2\times (10^4)^2}{10^6}$

$= \frac{2\times 10^8}{10^6}$

$=2 \times 10^2$

$= 200sec$

Qus : 11

To access the I/O devices the status flags is continuously checked in

1
2
3
4
Go to Discussion

Solution

Programmed I/O: In program-controlled I/O, the processor program controls the complete data transfer. So only when an I/O transfer instruction is executed, the transfer could take place. It is required to check that device is ready/not for the data transfer in most cases. Usually, the transfer is to & from a CPU register & peripheral. Here, CPU constantly monitors the peripheral. Here, until the I/O unit indicates that it is ready for transfer, the CPU wait & stays in a loop. It is time-consuming as it keeps the CPU busy needlessly.

Qus : 12

Which one of the following Boolean algebraic rule is correct?

1
2
3
4
Go to Discussion

Solution

A + A'B = (A + A') . (A + B)

= 1 . (A + B)

= A + B

Qus : 13

The representation of a floating point binary number +1001.11 in 8 bit fraction and 6 bit exponent format is

1
2
3
4
Go to Discussion

Solution

Qus : 14

Which term is redundant in the expression AB + A'C + BC ?

1
2
3
4
Go to Discussion

Solution

Qus : 15

Let the memory access time is 10 miliseconds and cache hit ratio 15%. The effective memory access time is

1
2
3
4
Go to Discussion

Solution

Qus : 16

Which of the following is the representation of decimal number (- 147) in 2's compliment notation on a 12-bit machine?

1
2
3
4
Go to Discussion

Solution

Qus : 17

The first instruction of bootstrap loader program of an operating system is stored in

1
2
3
4
Go to Discussion

Solution

Qus : 18

Consider the equation (40)_x = (132)_y is some bases x and y. Then a possible set of value of x and y are

1
2
3
4
Go to Discussion

Solution

$\begin{array}{ll}{{{(40})}_x={{(132)}}_y} \\ {\Rightarrow4\times{x}^1}+0\times{x}^0=1\times{y}^2+3\times{y}^1+2\times{y}^0 \\ {\Rightarrow4x+0={y}^2+3y^{}+2} \\ {4x={y}^2+3y^{}+2}\end{array}$

Qus : 19

The smallest integer that can be represented by an 8 bit number in 2's complement form is

1
2
3
4
Go to Discussion

Solution

Qus : 20

Which of the following in a functionally complete set of gates?

I. NAND II. NOR

1
2
3
4
Go to Discussion

Solution

Qus : 21

The total number binary function that can be defined using n Boolean variables is

1
2
3
4
Go to Discussion

Solution

Qus : 22

Assume x' represents negation of x the Boolean function x'y' + xy + x'y is equivalent to?

1
2
3
4
Go to Discussion

Solution

Qus : 23

The memory unit which directly communicates with the CPU is known as

1
2
3
4
Go to Discussion

Solution

Qus : 24

Dynamic RAM consumes……. Power and ……than Static RAM

1
2
3
4
Go to Discussion

Solution

Qus : 25

The binary equivalent of (234.125)₁₀?

1
2
3
4
Go to Discussion

Solution

Qus : 26

Determine the octal equivalent of (432267)₁₀?

1
2
3
4
Go to Discussion

Solution

Qus : 27

One Exabyte is equal to …

1
2
3
4
Go to Discussion

Solution

Qus : 28

Consider the following circuit.

How many minimum numbers of two input NAND gates are required to design the above circuit?

1
2
3
4
Go to Discussion

Solution

Qus : 29

The time required for fetching and execution of one simple machine instruction is known as

1
2
3
4
Go to Discussion

Solution

Qus : 30

The equivalence of given expression x+x'y with Boolean theorem is….

1
2
3
4
Go to Discussion

Solution

x+x'y

=(x+x')(x+y)

=(x+y)

Qus : 31

The logic XOR operation of (4AC0)₁₆ and (B53F)₁₆ results

1
2
3
4
Go to Discussion

Solution

Qus : 32

The maximum and minimum value represented in signed 16-bit 2s compliment representation are

1
2
3
4
Go to Discussion

Solution

Maximum & Minimum in 16-bit 2's Complement

Total Bits: 16

Format: 1 sign bit + 15 magnitude bits

Maximum (positive): 0111 1111 1111 1111₍₂₎ = +32,767
Minimum (negative): 1000 0000 0000 0000₍₂₎ = −32,768

✅ Final Answer:
Minimum = −32,768
Maximum = +32,767

Qus : 33

Which of the following is true about Von Neumann architecture?

1
2
3
4
Go to Discussion

Solution

Qus : 34

Equivalent of the decimal number (25.375)10 in binary form

1
2
3
4
Go to Discussion

Solution

Decimal to Binary Conversion

? Given: Convert (25.375)₁₀ to binary.

? Step-by-step:

Integer Part (25):
Divide by 2 repeatedly:

25 ÷ 2 = 12 remainder 1  
12 ÷ 2 = 6  remainder 0  
6  ÷ 2 = 3  remainder 0  
3  ÷ 2 = 1  remainder 1  
1  ÷ 2 = 0  remainder 1

→ Binary: 11001

Fractional Part (0.375):
Multiply by 2 repeatedly:

0.375 × 2 = 0.75   → 0  
0.75 × 2  = 1.5    → 1  
0.5 × 2   = 1.0    → 1

→ Binary: .011

✅ Final Binary Answer: (25.375)₁₀ = (11001.011)₂

Qus : 35

Consider the following minterm for F:F(P, Q, R, S) = Σ0, 2, 5, 7, 8, 10, 13, 15. The minterms 2, 7, 8, and 13 are don't care terms. The minimal sum of products form for F is

1
2
3
4
Go to Discussion

Solution

Qus : 36

Suppose we have a 10-bit computer that uses 10-bit int (2's complement representation). the number representation of - 35 is

1
2
3
4
Go to Discussion

Solution

10-bit 2's Complement Representation of –35

Format: 10-bit signed integer using 2's complement representation.

Step-by-Step:

First, convert 35 to 10-bit binary: 0000100011
Find 1's complement: 1111011100
Add 1 (to get 2's complement): 1111011101

✅ Final Answer: 1111011101

–35 in 10-bit 2's complement: 1111011101

Qus : 37

A wrong sentence related to FAT 32 and NTFS file systems is

1
2
3
4
Go to Discussion

Solution

Qus : 38

A bulb in the staircase has two switches, one switch is at the ground floor and the other one is at the first floor. The bulb can be turned ON and also can be turned OFF by any of the switches irrespective of the state of the other switch. The logic of the switching of the bulb resembles

1
2
3
4
Go to Discussion

Solution

Staircase Bulb Switch Logic

Question:
A staircase bulb is controlled by two switches — one at each floor. Each switch can independently turn the bulb ON or OFF, regardless of the other switch's position. What logic gate does this resemble?

✅ Correct Answer: Exclusive OR (XOR) Gate

Explanation:

In XOR logic, the output is ON (1) when inputs are different, and OFF (0) when inputs are the same. Similarly, the bulb glows when the switches are in different states and turns OFF when both are in the same state.

Logic Used: XOR Gate

Qus : 39

Suppose we have a 10-bit computer that uses 10-bit floating point computational unit (Float number uses IEEE floating-point arithmetic where a floating point number has 1 sign bit, 5 exponent bits, and 4 fraction bits). The representation for +∞ (plus infinity) is

1
2
3
4
Go to Discussion

Solution

10-bit Floating Point: +∞ Representation

Format: The 10-bit floating point is structured as follows:

1 bit for sign (S)
5 bits for exponent (E)
4 bits for fraction/mantissa (F)

IEEE Rule for +∞:

In IEEE floating-point format, +∞ is represented as:

Sign bit (S): 0
Exponent bits (E): all 1s → 11111
Fraction bits (F): all 0s → 0000

✅ Final 10-bit Representation: 0111110000

Qus : 40

Cosider the following Boolean Expression for F:

$F(P,Q,R,S)=PQ+\overline{P}QR+\overline{P}Q\overline{R}S$ .

The minimum sum of products form of F is

1
2
3
4
Go to Discussion

Solution

Qus : 41

What is the name of the storage device that compensates the difference in rates of flow of data from one device to another?

1
2
3
4
Go to Discussion

Solution

Data Flow Management

Question:
What is the name of the storage device that compensates the difference in rates of flow of data from one device to another?

✅ Correct Answer: Buffer

Explanation:

A Buffer is a temporary storage area that helps in matching the speed of data transfer between a fast and a slow device, ensuring smooth data flow without loss.

Final Answer: Buffer

Qus : 42

If a processor clock is rated as million cycles per second, then its clock perios is:

1
2
3
4
Go to Discussion

Solution

Qus : 43

A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can hold a total of 128 page table entries and is 4 -way set associative. The minimum size of the TLB tag is:

1
2
3
4
Go to Discussion

Solution

To determine the minimum size of the TLB tag, let's break down the problem step by step.

1. Understand the Virtual Address Structure

The CPU generates 32-bit virtual addresses.

The page size is 4 KB, which means the offset within a page is determined by the lower bits of the virtual address.

2. Calculate the Number of Offset Bits

Page size = 4 KB =

$2^{12}$ bytes.

The offset within a page is determined by the lower 12 bits of the virtual address.

3. Calculate the Number of Virtual Page Number (VPN) Bits

Total virtual address bits = 32.

Offset bits = 12.

VPN bits = Total bits - Offset bits = 32−12=20 bits.

4. Understand the TLB StructureThe TLB is 4-way set associative, meaning there are 4 entries per set.

The TLB can hold a total of 128 page table entries.

Number of sets = Total entries / Associativity = 128/4=32 sets.

5. Calculate the Number of Set Index Bits

Number of sets = 32 =

$2^5$ .

The set index is determined by the lower 5 bits of the VPN.

6. Calculate the Number of Tag Bits

VPN bits = 20.

Set index bits = 5.

Tag bits = VPN bits - Set index bits = 20−5=15 bits.

7. Final Answer

The minimum size of the TLB tag is 15 bits.

Qus : 44

The number of minterms in a

$n$ variable truth tableis

1
2
3
4
Go to Discussion

Solution

Qus : 45

Let

$\oplus$ and

$\odot$ denote the Exclusive - OR and Exclusive-NOR operations respectively. Which of the following is not correct?

1
2
3
4
Go to Discussion

Solution

Qus : 46

Which of the following registers is used to keep track of address of the memory location where the next instruction is located?

1
2
3
4
Go to Discussion

Solution

Register Responsible for Next Instruction

Question:
Which of the following registers is used to keep track of the address of the memory location where the next instruction is located?

✅ Correct Answer: Program Counter (PC)

Explanation:

The Program Counter (PC) holds the address of the next instruction to be fetched from memory and executed by the CPU. After fetching the current instruction, it automatically updates to point to the next one.

Final Answer: Program Counter

Qus : 47

The time required for fetching and execution of one machine instruction is:

1
2
3
4
Go to Discussion

Solution

Time for Fetch & Execute

Definition:
The time required to fetch and execute one machine instruction is called a Machine Cycle / CPU Cycle.

Includes:

Instruction fetch
Instruction decode
Operand fetch (if any)
Execution
Result store (if any)

✅ Final Answer: Machine Cycle / CPU Cycle.

Qus : 48

Consider the circuit shown below and find minimum number of NAND gates required to design it.

1
2
3
4
Go to Discussion

Solution

Qus : 49

How many 32K

$\times$ 1 RAM chips are needed to provide a memory capacity of 256K bytes?

1
2
3
4
Go to Discussion

Solution

Quick Solution

Each RAM chip: 32K × 1 = 32K bits = 4 KB

Total required: 256 KB

Number of chips needed: 256 ÷ 4 = 64

✅ Final Answer: 64 chips

Qus : 50

What is a potential problem of 1’s complement representation of numbers?

1
2
3
4
Go to Discussion

Solution

Qus : 51

The reduced form of the Boolean function

$F=xyz+xyz^{\prime}^{}+x^{\prime}yz+xy^{\prime}z$ is

1
2
3
4
Go to Discussion

Solution

Qus : 52

In IEEE single precision floating point representation, exponent is represented in ______

1
2
3
4
Go to Discussion

Solution

Qus : 53

With 4-bit 2's complement arithmetic, which of the following addition will result in overflow?

1
2
3
4
Go to Discussion

Solution

Qus : 54

If the 2's complement representation of a number is (011010)₂ , what is its equivalent hexadecimal representation?

1
2
3
4
Go to Discussion

Solution

Qus : 55

For the circuit shown below, the complement of the output F is _________

1
2
3
4
Go to Discussion

Solution

Qus : 56

If N is a 16-bit signed integer, then 2's complement representation of N is (F87B)₁₆. The 2's complement representation of 8*N is

1
2
3
4
Go to Discussion

Solution

Qus : 57

The base ( or radix) of the number system such that the following equation holds 312/20 = 131.1 is

1
2
3
4
Go to Discussion

Solution

Qus : 58

Which of the following represents (D4)₁₆?

1
2
3
4
Go to Discussion

Solution

Qus : 59

How many Boolean expressions can be be formed with 3 Boolean variables?

1
2
3
4
Go to Discussion

Solution

Qus : 60

In an 8 bit representation of computer system the decimal number 47 has to be subtracted from 38 and the result in binary 2's complement is _________

1
2
3
4
Go to Discussion

Solution

Qus : 61

The maximum and minimum value represented in signed 16 bit 2's complement representations are

1
2
3
4
Go to Discussion

Solution

Range of 2's complement

$-2^{n-1}$ to

$2^{n-1}+1$

Range for 16 bits =

$-2^{16-1}$ to

$2^{16-1}+1$

Range for 16 bits =

$-2^{15}$ to

$2^{25}+1$

Range for 16 bits =

$-32768$ to

$32767$

Qus : 62

The minimum number of NAND gates required for implementing the Boolean expression

$AB+A\, \overline{B}C+A\, \overline{B}\, \overline{C}$

1
2
3
4
Go to Discussion

Solution

$AB+A\, \overline{B}C+A\, \overline{B}\, \overline{C}$

$AB+AB'C+AB'C'$

$AB+AB'(C+C')$

$AB+AB'$

$A(B+B')$

Qus : 63

Which of the following is equivalent to the Boolean expression:

$(X+Y).(X+\overline{Y}).(\overline{X}+Y)$

1
2
3
4
Go to Discussion

Solution

$(X+Y).(X+\overline{Y}).(\overline{X}+Y)$

$(X+Y)(X+Y')(X'+Y)$

$(XX+XY+YX+YY')(X'+Y)$

$(X+XY)(X'+Y)$

$X(1+Y)(X'+Y)$

$X(X'+Y)$

$XX'+XY$

$XY$

Qus : 64

Suppose the largest n bit number requires ‘d’ digits in decimal representation. Which of the following relations between ‘n’ and ‘d’ is approximately correct

1
2
3
4
Go to Discussion

Solution

n bits binary number required d -decimal digits.

So,

${10}^d{\gt}{2}^n$

Take on both side

$\log _{10}({10}^d)\gt{\log _{10}({2}^n)}^{}$

$d{\gt}n\log _{10}(2)$

Qus : 65

If a processor clock is rated as 2500 million cycles per second, then its clock period is:

1
2
3
4
Go to Discussion

Solution

we know that Frequency is defined as the number of cycles in one second

Number of cycle in 1 sec = 2500 million

=> Frequency = 2500 Mhz

we know that time period is the inverse of frequency and is defined as the time taken by one cycle.

$T = \frac{1}{F}$

$T = \frac{1}{2500 \times 10^{-6}}$

$T=4 \times 10^{-10}$ sec

Qus : 66

Write the simplified form of the Boolean expression

(A+C)(AD+AD')+AC+C

1
2
3
4
Go to Discussion

Solution

(A+C)(AD+AD')+AC+C

=(A+C)A(D+D')+C(A+1)

=(A+C)+C

=A+C

Qus : 67

FFFF will be the last memory location in a memory of size

1
2
3
4
Go to Discussion

Solution

The Hexadecimal digits are 0-9 and A-F. The Hexadecimal system represents numbers in16 symbols, zero to nine and ten to fifteen is represented by the English alphabet A-F.

The Hexadecimal character represents 4 bits.

The last memory location in a memory of size 64K is FFFF.

64K is

$2^{16}$ bytes, i.e.

$16^4$ bytes = 1000 bytes in hexadecimal code.

The last accessible address is 1000-1 = FFFF.

Qus : 68

‘Floating point representation' is used to represent

1
2
3
4
Go to Discussion

Solution

Qus : 69

The Boolean expression AB+ AB' + A'C + AC is unaffected by the value of the Boolean variable

1
2
3
4
Go to Discussion

Solution

$\begin{array}{ll}{A(B+\overline{B})+C(A+\overline{A})} \\ {A+C}\, \end{array}$

Qus : 70

If a signal passing through a gate is inhibited by sending a low into one of the inputs, and the output is HIGH, the gate is a(n):

1
2
3
4
Go to Discussion

Solution

Output is high if any of the input is low. The truth table for NAND gate is:

A	B	Output
0	0	0
0	1	1
1	0	1
1	1	1

Table representing NAND Gate.

Qus : 71

The 2's complement representation of the number (–100)₁₀ in an 8 bit computer is

1
2
3
4
Go to Discussion

Solution

Qus : 72

The number of terms in the product of sums canonical form of

1
2
3
4
Go to Discussion

Solution

Qus : 73

Find the odd man out :

1
2
3
4
Go to Discussion

Solution

Qus : 74

Consider a hard disk with 16 recording surfaces (0 – 15) having 16384 cylinders (0 – 16383) and each cylinder contains 64 sectors (0 – 63). Data storage capacity in each sector is 512 bytes. Data are organized stored in the disk and the starting disk location of the file is < 1200, 9, 40>. What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?

1
2
3
4
Go to Discussion

Solution

Qus : 75

Consider the following min term expression for F.

F(P,Q,R,S) = ∑ (0, 2, 5, 7, 8, 10, 13, 15)

The minterms 2, 7, 8 and 13 are ‘do not care' terms.

The minimal sum of products form for F is

1
2
3
4
Go to Discussion

Solution

Qus : 76

Consider the equation (43)_x= (y3)₈ where x and y are unknown. The number of possible solutions is

1
2
3
4
Go to Discussion

Solution

Qus : 77

Subtract (1010)₂ from (1101)₂using first complement

1
2
3
4
Go to Discussion

Solution

Qus : 78

A hard disk has a rotational speed of 6000 rpm. Its average latency time is

1
2
3
4
Go to Discussion

Solution

Qus : 79

The Boolean expression represented by the following Venn diagram is

1
2
3
4
Go to Discussion

Solution

Qus : 80

The range of n-bit signed magnitude representation is

1
2
3
4
Go to Discussion

Solution

Phrases

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Phrases

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Ask Your Question or Put Your Review.

Feedback

Info.

Information

Aspire's Library

Phrases Previous Year Questions (PYQs)

Phrases Computer PYQ

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Maximum & Minimum in 16-bit 2's Complement

Solution

Solution

Decimal to Binary Conversion

? Step-by-step:

Solution

Solution

10-bit 2's Complement Representation of –35

Step-by-Step:

Solution

Solution

Staircase Bulb Switch Logic

Explanation:

Solution

10-bit Floating Point: +∞ Representation

IEEE Rule for +∞:

Solution

Solution

Data Flow Management

Explanation:

Solution

Solution

Solution

Solution

Solution

Register Responsible for Next Instruction

Explanation:

Solution

Time for Fetch & Execute

Solution

Solution

Quick Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution